The Fast Search Motion Estimation Algorithms and Their Errors
نویسندگان
چکیده
This paper presents the analysis of errors produced by block matching motion estimation methods with lower computational cost (fast search algorithms). We try to find an answer on the question what measure can be used to determine correctness of searched motion vectors and which motion vectors are founded as fault (corrupted by noise). We consider the vector fields obtained by using of full search algorithm (FSA) as lossless data. We take the vectors of movement obtained by using 2D logarithmic (2D log) search procedure as data corrupted by noise. The results of analysis can help optimize post processing of motion vectors in endeavoring to reduce computational cost or regularize vector fields.
منابع مشابه
Adaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملA Frequency Based Hierarchical Fast Search Block Matching Algorithm for Fast Video Communication
Numerous fast-search block motion estimation algorithms have been developed to circumvent the high computational cost required by the full-search algorithm. These techniques however often converge to a local minimum, which makes them subject to noise and matching errors. Hence, many spatial domain block matching algorithms have been developed in literature. These algorithms exploit the high cor...
متن کاملOptimization of Fast Block Motion Estimation Algorithms - Circuits and Systems for Video Technology, IEEE Transactions on
There are basically three approaches for carrying out fast block motion estimation: 1) fast search by a reduction of motion vector candidates; 2) fast block-matching distortion (BMD) computation; and 3) motion field subsampling. The first approach has been studied more extensively since different ways of reducing motion vector candidates may result in significantly different performance; while ...
متن کامل8-bit Partial Sums of 16 Luminance Values for Fast Block Motion Estimation
Fast block motion estimation algorithms are needed for real-time implementations of video coding standards due to the high computational complexity of the full-search algorithm for block motion estimation. In this paper, an algorithm using 8-bit partial sums of 16 luminance values for a fast block motion estimation is proposed. The technique of using the partial sums is employed to reduce the c...
متن کاملReliable search strategy for block motion estimation by measuring the error surface
The conventional search algorithms for block matching motion estimation reduce the set of possible displacements for locating the motion vector. Nearly all of these algorithms rely on the assumption: the distortion function increases monotonically as the search location moves away from the global minimum. Obviously, this assumption essentially requires that the error surface be unimodal over th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008